Roundoo Error Analysis of the Fast Cosine Transform and of Its Application to the Chebyshev Pseudospectral Method
نویسندگان
چکیده
The roundoo error analysis of several algorithms commonly used to compute the Fast Cosine Transform and the derivatives using the Chebyshev pseudospectral method are studied. We derive precise expressions for the algorithmic error, and using them we give new theoretical upper bounds and produce a statistical analysis. The results are compared with numerical experiments.
منابع مشابه
Numerical solution of general nonlinear Fredholm-Volterra integral equations using Chebyshev approximation
A numerical method for solving nonlinear Fredholm-Volterra integral equations of general type is presented. This method is based on replacement of unknown function by truncated series of well known Chebyshev expansion of functions. The quadrature formulas which we use to calculate integral terms have been imated by Fast Fourier Transform (FFT). This is a grate advantage of this method which has...
متن کاملOn a solenoidal Fourier–Chebyshev spectral method for stability analysis of the Hagen–Poiseuille flow ✩
In this work we study the efficiency of a spectral Petrov–Galerkin method for the linear and nonlinear stability analysis of the pipe or Hagen–Poiseuille flow. We formulate the problem in solenoidal primitive variables for the velocity field and the pressure term is eliminated from the scheme suitably projecting the equations on another solenoidal subspace. The method is unusual in being based ...
متن کاملA Fast Poisson Solver by Chebyshev Pseudospectral Method Using Reflexive Decomposition
Poisson equation is frequently encountered in mathematical modeling for scientific and engineering applications. Fast Poisson numerical solvers for 2D and 3D problems are, thus, highly requested. In this paper, we consider solving the Poisson equation ∇2u = f(x, y) in the Cartesian domain Ω = [−1, 1] × [−1, 1], subject to all types of boundary conditions, discretized with the Chebyshev pseudosp...
متن کاملAn improved pseudospectral approximation of generalized Burger-Huxley and Fitzhugh-Nagumo equations
In this research paper, an improved Chebyshev-Gauss-Lobatto pseudospectral approximation of nonlinear Burger-Huxley and Fitzhugh- Nagumo equations have been presented. The method employs chebyshev Gauss-Labatto points in time and space to obtain spectral accuracy. The mapping has introduced and transformed the initial-boundary value non-homogeneous problem to homogeneous problem. The main probl...
متن کاملA Polynomial Approach to Fast Algorithms for Discrete Fourier-cosine and Fourier-sine Transforms
The discrete Fourier-cosine transform (cos-DFT), the discrete Fourier-sine transform (sin-DFT) and the discrete cosine transform (DCT) are closely related to the discrete Fourier transform (DFT) of real-valued sequences. This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994